Gracefully Degrading Systems Using the Bulk-Synchronous Parallel Model with Randomised Shared Memory

The Bulk-Synchronous Parallel Model, BSPM, was proposed as a bridging model for parallel computation by Valiant. By using Randomised Shared Memory, RSM, this model o ers an asymptotically optimal emulation of the PRAM[1]. By using the BSPM with RSM, we show how a gracefully degrading massively parallel system can be obtained through: memory duplication to ensure global memory integrity, and to speed up the recon guration; a global recon guration method that restores the logical properties of the system, after a fault occurs. We assume fail-stop processors, single faults, no spare processors, and no signi cant loss of network throughput as a result of faults. Work done during recon guration is shared equally among the live processors, with minimal coordination. The overhead of the scheme and the graceful degradation achieved depend on the program being executed. We evaluate the recon guration, overhead, and graceful degradation of the system experimentally.